power uniti form team larg dscale commun system onlin network design outlier optim framework queri recommend queri recommend integr part modern search engin goal queri recommend facilit user search inform queri recommend user explor concept relat inform paper present formal treatment problem queri recommend framework model queri behavior user probabilist reformul graph queri flow graph boldi al cikm sequenc queri submit user path graph assign score valu queri defin suitabl util function expect util achiev reformul path queri flow graph provid recommend ad shortcut queri flow graph nudg reformul path user user follow path larger expect util discuss detail import question aris propos framework provid exampl meaning util function optim discuss estim effect recommend reformul probabl address complex optim problem suggest effici algorithm solut valid model algorithm extens experiment techniqu appli scenario user behavior model markov process sort sort dynam data abstract formul studi comput model dynam data model data gradual goal algorithm comput solut problem data time step constraint limit access data time data constantli chang algorithm unawar expect output exact solut interest algorithm guarante output approxim solut focu fundament problem sort select true order element slowli provid algorithm perform close optim expect high probabl onlin pair voip convers influenc correl social network onlin social system social ti user plai import role dictat behavior wai happen social influenc phenomenon action user induc friend behav similar system social influenc exist idea mode behavior technolog diffus network epidem identifi understand social influenc tremend interest analysi design point view difficult task gener factor homophili unobserv confound variabl induc statist correl action friend social network distinguish influenc essenti problem distinguish correl causal notori hard statist problem paper studi problem systemat defin fairli gener model replic aforement sourc social correl propos simpl test identifi influenc sourc social correl time seri user action give theoret justif test prove high probabl succe rule influenc gener model social correl simul test number exampl design randomli gener action node real social network flickr model simul result confirm test perform data final appli real tag data flickr exhibit signific social correl tag behavior system correl attribut social influenc approxim algorithm dcluster cluster simultan partit row column matrix block induc row column partit good cluster motiv applic text mine market basket analysi bioinformat problem attract sever attent past year date algorithm work problem heurist natur work obtain approxim algorithm cluster problem algorithm simpl obtain constant factor approxim solut optimum show cluster np hard complement algorithm result effect effici classif search dengin model tradit document classif framework appli learn classifi document corpu infeas extrem larg document corpora web larg corpor intranet classif problem corpu process primarili purpos search access document sole invert index larg scale search engin main goal build short queri character document class oper larg engin show surprisingli good classif accuraci achiev averag multipl class queri term show optim effici queri execut care select term reduc queri cost precis show set term queri achiev accuraci svm classifi term toler reduct svm build term queri execut fast term queri din dtime contextu advertis contextu advertis type web advertis url web page aim emb page typic javascript relev textual ad static page displai repeatedli match ad base prior analysi entir content ad match dynam creat page process ahead time analyz entir bodi page onth fly entail prohibit commun latenc cost solv horn dilemma low relev high latenc high load propos text summar techniqu pair extern knowledg exogen page craft short page summari real time empir evalu prove match ad basi summari sacrific relev competit match base entir page content specif found analyz carefulli select fraction page text sacrific ad relev summari fulli compat standard javascript mechan ad placement produc ad displai time simpl addit usual script add byte usual request find talk voip network progress stream cluster effect effici classif search dengin model tradit document classif framework appli learn classifi document corpu infeas extrem larg document corpora web larg corpor intranet classif problem corpu process primarili purpos search access document sole invert index larg scale search engin main goal build short queri character document class oper larg engin show surprisingli good classif accuraci achiev averag multipl class queri term show optim effici queri execut care select term reduc queri cost precis show set term queri achiev accuraci svm classifi term toler reduct svm build term queri execut fast term queri find talk voip network progress stream cluster global distanc dbase segment trajectori work introduc distanc base criteria segment object trajectori segment lead simplif origin object smaller complex primit suit storag retriev purpos previou work trajectori segment attack problem local segment separ trajectori databas directli optim inter object separ mine oper search cluster classif larg databas paper analyz trajectori segment problem global perspect util data awar distanc base optim techniqu optim pairwis distanc estim lead effici object prune deriv exact solut distanc base formul due intract complex exact solut present approxim greedi solut exploit forward search local optim solut greedi solut impos prohibit comput cost put forward lightweight varianc base segment techniqu intellig relax pairwis distanc area affect mine oper simul anneal approach travel tournament problem autom schedul sport leagu receiv consider attent recent year applic involv signific revenu gener challeng combinatori optim problem paper consid travel tournament problem ttp propos abstract salient featur major leagu basebal mlb unit state propos simul anneal algorithm ttsa ttp explor feasibl infeas schedul larg neighborhood complex move includ advanc techniqu strateg oscil reheat balanc explor feasibl infeas region escap local minima low temperatur sampl search dengin result problem cientli sampl web search engin queri result turn small random sampl full set result lead cient approxim algorithm applic determin set categori taxonomi span search result find rang metadata valu result set order enabl multi facet search estim size result set data mine associ queri term sampl search dengin result problem cientli sampl web search engin queri result turn small random sampl full set result lead cient approxim algorithm applic determin set categori taxonomi span search result find rang metadata valu result set order enabl multi facet search estim size result set data mine associ queri term steadi state analysi balanc dalloc rout compar long term steadi state perform variant standard dynam altern rout dar techniqu commonli telephon atm network perform path select algorithm base balanc alloc principl azer broder karlin upfal siam comput mitzenmach ph thesi univers california berkelei august refer algorithm balanc dynam altern rout bdar algorithm dar check altern rout sequenti bandwidth found bdar algorithm compar choos small number altern show expens minor increas rout overhead bdar algorithm substanti improv network perform term network congest bandwidth requir wilei period random struct alg load balanc arbitrari network topolog stochast adversari input studi long term steadi state perform simpl random local load balanc techniqu broad rang input condit assum system processor connect arbitrari network topolog job processor determinist random adversari adversari current past load distribut network inform place task processor node execut job step particip load balanc oper move task direct neighbor network protocol analyz node equal load random neighbor graph simpl determinist competit algorithm onlin facil locat paper present determinist cient algorithm onlin facil locat algorithm base simpl hierarch partit extrem simpl implement appli varieti model model facil region custom site fix locat paper show algorithm log competit model show algorithm competit high probabl arriv order custom uniformli distribut follow distribut satisfi smooth properti experiment result varieti scenario algorithm behav extrem practic stabil effici random local load balanc protocol studi long term steadi state perform simpl random local load balanc techniqu assum system processor connect arbitrari network topolog job processor determinist random adversari adversari current past load distribut network inform place task processor adversari put number job processor step long expect total number job arriv step bound node execut job step particip load balanc oper move task direct neighbor network protocol analyz node equal load random neighbor graph simul anneal approach travel tournament problem autom schedul sport leagu receiv consider attent recent year applic involv signific revenu gener challeng combinatori optim problem paper consid travel tournament problem ttp propos abstract salient featur major leagu basebal mlb unit state propos simul anneal algorithm ttsa ttp explor feasibl infeas schedul larg neighborhood complex move includ advanc techniqu strateg oscil reheat balanc explor feasibl infeas region escap local minima low temperatur persist authent dictionari applic introduc notion persist authent dictionari dictionari user make queri type element set time authent answer applic includ credenti certif valid check past digit signatur electron contract digit receipt electron ticket present data structur effici support infrastructur persist authent dictionari compar perform 